Locality Conditions and the Complexity of Minimalist Grammars: A Preliminary Survey

نویسنده

  • Hans-Martin Gärtner
چکیده

Among the well-established variety of formal grammar types providing a mildly context-sensitive grammar (MCSG) formalism in the sense of Joshi (1985), Stabler’s minimalist grammars (MGs) (Stabler 1997, 1999) come closest to modeling the tools used in the Chomskyan branch of generative syntax known as “minimalism” (Chomsky 1995, 2000, 2001). Interestingly, without there being a rise in (at least weak) generative power, (extensions and variants of) MGs accommodate a wide variety of (arguably) “odd” items from the syntactician’s toolbox, such as head movement (Stabler 1997, 2001), affix hopping (Stabler 2001), (strict) remnant movement (Stabler 1997, 1999), and (to some extent) adjunction and scrambling (Frey and Gärtner 2002; Gärtner and Michaelis 2003). As a descendant of transformational grammar (TG), minimalism carries over the division of labor between a phrase-structural and a transformational component. These find their way into MGs as operations merge and move, respectively. As is well-known, the Aspects-vintage of TG (Chomsky 1965) was shown to be Turing equivalent by Peters and Ritchie 1973. This led to intensive investigation into locality conditions (LCs) (Chomsky 1973, 1977, 1986; Rizzi 1990; Cinque 1990; Manzini 1992; among others) in an attempt to restrict the power of transformations. However, complexity results for these grammars with LC-add-ons are largely absent.1 This picture has changed with MGs, as a formalized version of minimalism, which were shown to belong among

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locality and the Complexity of Minimalist Derivation Tree Languages

Minimalist grammars provide a formalization of Minimalist syntax which allows us to study how the components of said theory affect its expressivity. A central concern of Minimalist syntax is the locality of the displacement operation Move. In Minimalist grammars, however, Move is unbounded. This paper is a study of the repercussions of limiting movement with respect to the number of slices a mo...

متن کامل

A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars

Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they fall into two groups. On the one hand there are intervention-based LCs (ILCs) often formulated as “minimality constraints” (“minimal link condition,” “minimize chain links,”“shortest move,”“attract closest,” etc.). O...

متن کامل

A Note on the Complexity of the Recognition Problem for the Minimalist Grammars with Unbounded Scrambling and Barriers

Minimalist Grammars were proposed recently as a model for the formal description of the natural-language syntax. This paper explores a nonlocal extension to this formalism that would make it possible to describe unbounded scrambling which is a discriptionally problematic syntactic phenomenon attested in many languages. It is shown that extending Minimalist Grammars with scrambling without short...

متن کامل

Memory limitations in sentence comprehension: a structural-based complexity metric of processing difficulty

This dissertation addresses the question of how linguistic structures can be represented in working memory. We propose a memory-based computational model that derives offline and online complexity profiles in terms of a top-down parser for minimalist grammars (Stabler, 2011). The complexity metric reflects the amount of time an item is stored in memory. The presented architecture links grammati...

متن کامل

Minimalist Grammar Transition-Based Parsing

Current chart-based parsers of Minimalist Grammars exhibit prohibitively high polynomial complexity that makes them unusable in practice. This paper presents a transition-based parser for Minimalist Grammars that approximately searches through the space of possible derivations by means of beam search, and does so very efficiently: the worst case complexity of building one derivation is O(n) and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007